TSTP Solution File: ITP187^1 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : ITP187^1 : TPTP v8.1.2. Released v7.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n010.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sat May  4 08:07:16 EDT 2024

% Result   : Theorem 252.42s 32.81s
% Output   : CNFRefutation 252.42s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   25
% Syntax   : Number of formulae    :   31 (   5 unt;  22 typ;   0 def)
%            Number of atoms       :   13 (   0 equ;   0 cnn)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :  171 (   5   ~;   2   |;   2   &; 162   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (  11 avg)
%            Number of types       :    7 (   6 usr)
%            Number of type conns  :   15 (  15   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   17 (  16 usr;  10 con; 0-3 aty)
%            Number of variables   :    4 (   0   ^   2   !;   2   ?;   4   :)

% Comments : 
%------------------------------------------------------------------------------
thf(decl_sort1,type,
    pi: $tType ).

thf(decl_sort2,type,
    name: $tType ).

thf(decl_sort3,type,
    late_freeRes: $tType ).

thf(decl_sort4,type,
    late_residual: $tType ).

thf(decl_sort5,type,
    product_prod_pi_pi: $tType ).

thf(decl_sort6,type,
    set_Pr1834926343_pi_pi: $tType ).

thf(decl_27,type,
    par: pi > pi > pi ).

thf(decl_29,type,
    res: name > pi > pi ).

thf(decl_32,type,
    subs: pi > name > name > pi ).

thf(decl_36,type,
    late_TauR: late_freeRes ).

thf(decl_38,type,
    late_FreeR: late_freeRes > pi > late_residual ).

thf(decl_41,type,
    late_transitions: pi > late_residual > $o ).

thf(decl_78,type,
    product_Pair_pi_pi: pi > pi > product_prod_pi_pi ).

thf(decl_91,type,
    member558706512_pi_pi: product_prod_pi_pi > set_Pr1834926343_pi_pi > $o ).

thf(decl_92,type,
    p: pi ).

thf(decl_94,type,
    p2: pi ).

thf(decl_95,type,
    q: pi ).

thf(decl_97,type,
    q2: pi ).

thf(decl_98,type,
    r: pi ).

thf(decl_99,type,
    rel: set_Pr1834926343_pi_pi ).

thf(decl_102,type,
    x: name ).

thf(decl_103,type,
    y: name ).

thf(conj_0,conjecture,
    ? [X409: pi] :
      ( ( late_transitions @ ( par @ ( par @ p @ q ) @ r ) @ ( late_FreeR @ late_TauR @ X409 ) )
      & ( member558706512_pi_pi @ ( product_Pair_pi_pi @ X409 @ ( res @ y @ ( par @ p2 @ ( subs @ ( par @ q2 @ r ) @ x @ y ) ) ) ) @ rel ) ),
    file('/export/starexec/sandbox2/tmp/tmp.FaZrxe08S4/E---3.1_28899.p',conj_0) ).

thf(fact_6__092_060open_062_I_060_092_060nu_062y_062_IP_H_A_092_060parallel_062_AQ_H_091x_058_058_061y_093_J_A_092_060parallel_062_AR_M_A_060_092_060nu_062y_062_IP_H_A_092_060parallel_062_A_IQ_H_A_092_060parallel_062_AR_J_091x_058_058_061y_093_J_J_A_092_060in_062_ARel_092_060close_062,axiom,
    member558706512_pi_pi @ ( product_Pair_pi_pi @ ( par @ ( res @ y @ ( par @ p2 @ ( subs @ q2 @ x @ y ) ) ) @ r ) @ ( res @ y @ ( par @ p2 @ ( subs @ ( par @ q2 @ r ) @ x @ y ) ) ) ) @ rel,
    file('/export/starexec/sandbox2/tmp/tmp.FaZrxe08S4/E---3.1_28899.p',fact_6__092_060open_062_I_060_092_060nu_062y_062_IP_H_A_092_060parallel_062_AQ_H_091x_058_058_061y_093_J_A_092_060parallel_062_AR_M_A_060_092_060nu_062y_062_IP_H_A_092_060parallel_062_A_IQ_H_A_092_060parallel_062_AR_J_091x_058_058_061y_093_J_J_A_092_060in_062_ARel_092_060close_062) ).

thf(fact_7__092_060open_062_IP_A_092_060parallel_062_AQ_J_A_092_060parallel_062_AR_A_092_060longmapsto_062_A_092_060tau_062_A_092_060prec_062_A_060_092_060nu_062y_062_IP_H_A_092_060parallel_062_AQ_H_091x_058_058_061y_093_J_A_092_060parallel_062_AR_092_060close_062,axiom,
    late_transitions @ ( par @ ( par @ p @ q ) @ r ) @ ( late_FreeR @ late_TauR @ ( par @ ( res @ y @ ( par @ p2 @ ( subs @ q2 @ x @ y ) ) ) @ r ) ),
    file('/export/starexec/sandbox2/tmp/tmp.FaZrxe08S4/E---3.1_28899.p',fact_7__092_060open_062_IP_A_092_060parallel_062_AQ_J_A_092_060parallel_062_AR_A_092_060longmapsto_062_A_092_060tau_062_A_092_060prec_062_A_060_092_060nu_062y_062_IP_H_A_092_060parallel_062_AQ_H_091x_058_058_061y_093_J_A_092_060parallel_062_AR_092_060close_062) ).

thf(c_0_3,negated_conjecture,
    ~ ? [X409: pi] :
        ( ( late_transitions @ ( par @ ( par @ p @ q ) @ r ) @ ( late_FreeR @ late_TauR @ X409 ) )
        & ( member558706512_pi_pi @ ( product_Pair_pi_pi @ X409 @ ( res @ y @ ( par @ p2 @ ( subs @ ( par @ q2 @ r ) @ x @ y ) ) ) ) @ rel ) ),
    inference(assume_negation,[status(cth)],[conj_0]) ).

thf(c_0_4,negated_conjecture,
    ! [X2042: pi] :
      ( ~ ( late_transitions @ ( par @ ( par @ p @ q ) @ r ) @ ( late_FreeR @ late_TauR @ X2042 ) )
      | ~ ( member558706512_pi_pi @ ( product_Pair_pi_pi @ X2042 @ ( res @ y @ ( par @ p2 @ ( subs @ ( par @ q2 @ r ) @ x @ y ) ) ) ) @ rel ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).

thf(c_0_5,negated_conjecture,
    ! [X1: pi] :
      ( ~ ( late_transitions @ ( par @ ( par @ p @ q ) @ r ) @ ( late_FreeR @ late_TauR @ X1 ) )
      | ~ ( member558706512_pi_pi @ ( product_Pair_pi_pi @ X1 @ ( res @ y @ ( par @ p2 @ ( subs @ ( par @ q2 @ r ) @ x @ y ) ) ) ) @ rel ) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

thf(c_0_6,plain,
    member558706512_pi_pi @ ( product_Pair_pi_pi @ ( par @ ( res @ y @ ( par @ p2 @ ( subs @ q2 @ x @ y ) ) ) @ r ) @ ( res @ y @ ( par @ p2 @ ( subs @ ( par @ q2 @ r ) @ x @ y ) ) ) ) @ rel,
    inference(split_conjunct,[status(thm)],[fact_6__092_060open_062_I_060_092_060nu_062y_062_IP_H_A_092_060parallel_062_AQ_H_091x_058_058_061y_093_J_A_092_060parallel_062_AR_M_A_060_092_060nu_062y_062_IP_H_A_092_060parallel_062_A_IQ_H_A_092_060parallel_062_AR_J_091x_058_058_061y_093_J_J_A_092_060in_062_ARel_092_060close_062]) ).

thf(c_0_7,plain,
    late_transitions @ ( par @ ( par @ p @ q ) @ r ) @ ( late_FreeR @ late_TauR @ ( par @ ( res @ y @ ( par @ p2 @ ( subs @ q2 @ x @ y ) ) ) @ r ) ),
    inference(split_conjunct,[status(thm)],[fact_7__092_060open_062_IP_A_092_060parallel_062_AQ_J_A_092_060parallel_062_AR_A_092_060longmapsto_062_A_092_060tau_062_A_092_060prec_062_A_060_092_060nu_062y_062_IP_H_A_092_060parallel_062_AQ_H_091x_058_058_061y_093_J_A_092_060parallel_062_AR_092_060close_062]) ).

thf(c_0_8,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14  % Problem    : ITP187^1 : TPTP v8.1.2. Released v7.5.0.
% 0.08/0.15  % Command    : run_E %s %d THM
% 0.14/0.35  % Computer : n010.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Fri May  3 11:52:48 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.20/0.50  Running higher-order theorem proving
% 0.20/0.50  Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.FaZrxe08S4/E---3.1_28899.p
% 252.42/32.81  # Version: 3.1.0-ho
% 252.42/32.81  # Preprocessing class: HSLSSMSMSSSNSFA.
% 252.42/32.81  # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 252.42/32.81  # Starting new_ho_10 with 900s (3) cores
% 252.42/32.81  # Starting sh2lt with 300s (1) cores
% 252.42/32.81  # Starting new_ho_5 with 300s (1) cores
% 252.42/32.81  # Starting full_lambda_5 with 300s (1) cores
% 252.42/32.81  # Starting sh9 with 300s (1) cores
% 252.42/32.81  # Starting ehoh_best8_lambda with 300s (1) cores
% 252.42/32.81  # sh2lt with pid 28978 completed with status 0
% 252.42/32.81  # Result found by sh2lt
% 252.42/32.81  # Preprocessing class: HSLSSMSMSSSNSFA.
% 252.42/32.81  # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 252.42/32.81  # Starting new_ho_10 with 900s (3) cores
% 252.42/32.81  # Starting sh2lt with 300s (1) cores
% 252.42/32.81  # SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 252.42/32.81  # Search class: HGHSM-SMLM31-MSFFFMBN
% 252.42/32.81  # Scheduled 6 strats onto 1 cores with 298 seconds (298 total)
% 252.42/32.81  # Starting new_ho_10 with 161s (1) cores
% 252.42/32.81  # new_ho_10 with pid 28983 completed with status 0
% 252.42/32.81  # Result found by new_ho_10
% 252.42/32.81  # Preprocessing class: HSLSSMSMSSSNSFA.
% 252.42/32.81  # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 252.42/32.81  # Starting new_ho_10 with 900s (3) cores
% 252.42/32.81  # Starting sh2lt with 300s (1) cores
% 252.42/32.81  # SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 252.42/32.81  # Search class: HGHSM-SMLM31-MSFFFMBN
% 252.42/32.81  # Scheduled 6 strats onto 1 cores with 298 seconds (298 total)
% 252.42/32.81  # Starting new_ho_10 with 161s (1) cores
% 252.42/32.81  # Preprocessing time       : 2.167 s
% 252.42/32.81  # Presaturation interreduction done
% 252.42/32.81  
% 252.42/32.81  # Proof found!
% 252.42/32.81  # SZS status Theorem
% 252.42/32.81  # SZS output start CNFRefutation
% See solution above
% 252.42/32.81  # Parsed axioms                        : 432
% 252.42/32.81  # Removed by relevancy pruning/SinE    : 180
% 252.42/32.81  # Initial clauses                      : 28417
% 252.42/32.81  # Removed in clause preprocessing      : 18
% 252.42/32.81  # Initial clauses in saturation        : 28399
% 252.42/32.81  # Processed clauses                    : 28434
% 252.42/32.81  # ...of these trivial                  : 1
% 252.42/32.81  # ...subsumed                          : 24
% 252.42/32.81  # ...remaining for further processing  : 28409
% 252.42/32.81  # Other redundant clauses eliminated   : 7
% 252.42/32.81  # Clauses deleted for lack of memory   : 0
% 252.42/32.81  # Backward-subsumed                    : 0
% 252.42/32.81  # Backward-rewritten                   : 0
% 252.42/32.81  # Generated clauses                    : 8
% 252.42/32.81  # ...of the previous two non-redundant : 6
% 252.42/32.81  # ...aggressively subsumed             : 0
% 252.42/32.81  # Contextual simplify-reflections      : 0
% 252.42/32.81  # Paramodulations                      : 1
% 252.42/32.81  # Factorizations                       : 0
% 252.42/32.81  # NegExts                              : 0
% 252.42/32.81  # Equation resolutions                 : 7
% 252.42/32.81  # Disequality decompositions           : 0
% 252.42/32.81  # Total rewrite steps                  : 5
% 252.42/32.81  # ...of those cached                   : 0
% 252.42/32.81  # Propositional unsat checks           : 0
% 252.42/32.81  #    Propositional check models        : 0
% 252.42/32.81  #    Propositional check unsatisfiable : 0
% 252.42/32.81  #    Propositional clauses             : 0
% 252.42/32.81  #    Propositional clauses after purity: 0
% 252.42/32.81  #    Propositional unsat core size     : 0
% 252.42/32.81  #    Propositional preprocessing time  : 0.000
% 252.42/32.81  #    Propositional encoding time       : 0.000
% 252.42/32.81  #    Propositional solver time         : 0.000
% 252.42/32.81  #    Success case prop preproc time    : 0.000
% 252.42/32.81  #    Success case prop encoding time   : 0.000
% 252.42/32.81  #    Success case prop solver time     : 0.000
% 252.42/32.81  # Current number of processed clauses  : 29
% 252.42/32.81  #    Positive orientable unit clauses  : 17
% 252.42/32.81  #    Positive unorientable unit clauses: 0
% 252.42/32.81  #    Negative unit clauses             : 11
% 252.42/32.81  #    Non-unit-clauses                  : 1
% 252.42/32.81  # Current number of unprocessed clauses: 28344
% 252.42/32.81  # ...number of literals in the above   : 306674
% 252.42/32.81  # Current number of archived formulas  : 0
% 252.42/32.81  # Current number of archived clauses   : 28373
% 252.42/32.81  # Clause-clause subsumption calls (NU) : 27578911
% 252.42/32.81  # Rec. Clause-clause subsumption calls : 31067
% 252.42/32.81  # Non-unit clause-clause subsumptions  : 20
% 252.42/32.81  # Unit Clause-clause subsumption calls : 896
% 252.42/32.81  # Rewrite failures with RHS unbound    : 0
% 252.42/32.81  # BW rewrite match attempts            : 7
% 252.42/32.81  # BW rewrite match successes           : 0
% 252.42/32.81  # Condensation attempts                : 28434
% 252.42/32.81  # Condensation successes               : 0
% 252.42/32.81  # Termbank termtop insertions          : 5542622
% 252.42/32.81  # Search garbage collected termcells   : 191593
% 252.42/32.81  
% 252.42/32.81  # -------------------------------------------------
% 252.42/32.81  # User time                : 31.844 s
% 252.42/32.81  # System time              : 0.264 s
% 252.42/32.81  # Total time               : 32.108 s
% 252.42/32.81  # Maximum resident set size: 61300 pages
% 252.42/32.81  
% 252.42/32.81  # -------------------------------------------------
% 252.42/32.81  # User time                : 31.862 s
% 252.42/32.81  # System time              : 0.271 s
% 252.42/32.81  # Total time               : 32.133 s
% 252.42/32.81  # Maximum resident set size: 2804 pages
% 252.42/32.81  % E---3.1 exiting
% 252.61/32.82  % E exiting
%------------------------------------------------------------------------------